8.1 Point Counting

نویسنده

  • Andrew V. Sutherland
چکیده

We now consider the problem of determining the number of points on an elliptic curve E over a finite field Fq. The most näıve approach one could take would be to evaluate the curve equation y2 = x3 + Ax + B for E at every pair (x, y) ∈ Fq , count the number of solutions, and add 1 for the point at infinity. This takes O(q2M(log q)) time. Note that the input to this problem is the pair of coefficients A,B ∈ Fq, which each have O(n) bits, where n = log q. Thus in terms of the size of its input, this algorithm takes

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

8 Point Counting 8.1 Hasse's Theorem

We are now ready to prove Hasse's theorem.

متن کامل

Assessment of Ki67 in Breast Cancer: A Comparison Between the Eye-10 Method, Stepwise Counting Strategy, and International System of Ki67 Evaluation

Background & Objective: Ki-67 evaluation is an essential tool to define luminal A and B breast cancers, which is not yet systematized. The International Ki67 in Breast Cancer Working Group suggests the counting of 500 or 1000 cancer cells, which is a time-consuming process. Therefore, novel methods, such as the Eye-10 method and stepwise counting strategy, are proposed to facil...

متن کامل

Bone marrow cellularity assessed by point-counting.

A simple method for rapid point-counting of bone marrow biopsies is described; the method gave an accurate assessment of cellularity in 100 aspiration biopsy specimens. Measurements of marrow cellularity by the visual point-counting technique correlated well with those obtained with a Quantimet 720 image-analysing computer.

متن کامل

On Complexity of Counting Fixed Point Configurations in Certain Classes of Graph Automata

We study computational complexity of counting the fixed point configurations (FPs) in certain discrete dynamical systems. We prove that counting FPs in Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively) is computationally intractable, even when each node is required to update according to a symmetric Boolean function. We also show that the problems of counting the garde...

متن کامل

راهبردهای انحراف توجه در افزایش تحمل درد آزمایشگاهی

Background & Aim: Pain is the most common compliant of the patients and its reduction or elimination had been always demand of most patients and health care providers. Various methods have been proposed to pain, which we can mention to attention deviation strategies. The study aims to compare these strategies and choose the most effective one method for control the pain. Methods & Materials: Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013